Two Families of Facets for the Two-Dimensional Mixed Integer Infinite Group Problem

نویسندگان

  • Santanu S. Dey
  • Jean-Philippe P. Richard
چکیده

In this paper, we lay the foundation for the study of the two-dimensional mixed integer infinite group problem (2DMIIGP). We introduce tools to determine if a given continuous and piecewise linear function over the two-dimensional infinite group is subadditive and to determine whether it defines a facet. We then present two different constructions that yield the first known families of facet-defining inequalities for 2DMIIGP. The first construction uses valid inequalities of the one dimensional integer infinite group problem (1DIIGP) as building block for creating inequalities for the two-dimensional integer infinite group problem (2DIIGP). We prove that this construction yields all continuous piecewise linear facets of the two-dimensional group problem that have exactly two gradients. The second construction we present has three gradients and yields facet-defining inequalities of 2DMIIGP whose continuous coefficients are not dominated by those of facets of one-dimensional mixed integer group problem (1DMIIGP).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Facets of Two-Dimensional Infinite Group Problems

In this paper, we lay the foundation for the study of the two-dimensional mixed integer infinite group problem (2DMIIGP). We introduce tools to determine if a given continuous and piecewise linear function over the two-dimensional infinite group is subadditive and to determine whether it defines a facet of 2DMIIGP. We then present two different constructions that yield the first known families ...

متن کامل

Generalized Mixed Integer Rounding Valid Inequalities

We present new families of valid inequalities for (mixed) integer programming (MIP) problems. These valid inequalities are based on a generalization of the 2-step mixed integer rounding (MIR), proposed by Dash and Günlük (2006). We prove that for any positive integer n, n facets of a certain (n + 1)-dimensional mixed integer set can be obtained through a process which includes n consecutive app...

متن کامل

n-step MIR Functions: Facets for Finite and Infinite Group Problems

The n-step mixed integer rounding (MIR) functions are used to generate n-step MIR inequalities for (mixed) integer programming problems (Kianfar and Fathi, 2006). We show that these functions are sources for generating extreme valid inequalities (facets) for group problems. We first prove the n-step MIR function, for any positive integer n, generates two-slope facets for the infinite group prob...

متن کامل

Relations between facets of low- and high-dimensional group problems

One-dimensional infinite group problems have been extensively studied and have yielded strong cutting planes for mixed integer programs. Although numerical and theoretical studies suggest that group cuts can be significantly improved by considering higher-dimensional groups, there are no known facets for infinite group problems whose dimension is larger than two. In this paper, we introduce an ...

متن کامل

On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints

In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the underlying finite integer program.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006